Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
نویسندگان
چکیده
The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic. Our main results are polynomial time algorithms for obtaining proofs of unsatisfiability and interpolants for conjunctions of linear diophantine equations, linear modular equations (linear congruences), and linear diophantine disequations. We show the utility of the proposed interpolation algorithms for discovering modular/divisibility predicates in a counterexample guided abstraction refinement (CEGAR) framework. This has enabled verification of simple programs that cannot be checked using existing CEGAR based model checkers.
منابع مشابه
Diophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملApplication of Fuzzy Bicubic Splines Interpolation for Solving Two-Dimensional Linear Fuzzy Fredholm Integral Equations
In this paper, firstly, we review approximation of fuzzy functions by fuzzy bicubic splines interpolation and present a new approach based on the two-dimensional fuzzy splines interpolation and iterative method to approximate the solution of two-dimensional linear fuzzy Fredholm integral equation (2DLFFIE). Also, we prove convergence analysis and numerical stability analysis ...
متن کاملVerification using Satisfiability Checking, Predicate Abstraction, and Craig Interpolation
Automatic verification of hardware and software implementations is crucial for building reliable computer systems. Most verification tools rely on decision procedures to check the satisfiability of various formulas that are generated during the verification process. This thesis develops new techniques for building efficient decision procedures and adds new capabilities to the existing decision ...
متن کاملClassical and Modular Approaches to Exponential Diophantine Equations Ii. the Lebesgue–nagell Equation
This is the second in a series of papers where we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we use a general and powerful new lower bound for linear forms in three logarithms, together with a combination of classical...
متن کاملClassical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers
This is the first in a series of papers whereby we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we give new improved bounds for linear forms in three logarithms. We also apply a combination of classical techniques with ...
متن کامل